On biclique coverings
نویسندگان
چکیده
It was proved by Fronček, Jerebic, Klavžar, and Kovář that if a complete bipartite graph Kn,n with a perfect matching removed can be covered by k bicliques, then n ≤ ( k b k 2 c ) . We give a slightly simplified proof and we show that the result is tight. Moreover we use the result to prove analogous bounds for coverings of some other classes of graphs by bicliques. ∗Supported by the University of Minnesota Duluth Grant 177–1009.
منابع مشابه
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
The strong isometric dimension of a graphG is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner’s Theorem, the strong isometric dimension of the Hamming graphs K2 Kn is determined.
متن کاملBiclique coverings, rectifier networks and the cost of $\varepsilon$-removal
We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number Cov(G) and the minimal rectifier network size Rect(G) of a bipartite graph G. We show that there exist graphs with Cov(G) ≥ Rect(G). As a corollary, we establish that there exist nondeterministic finite automata (NFAs) with εtransitions, having n transitions total such that the smallest equivalent ...
متن کاملThe Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of König’s theorem, results on Turán numbers, biclique partitions, clique coverings, hypergraphical Steiner systems, p-ranks, stellar permutations, the construction of new distance-regular graphs, large sets of equiangular lines, a bound on the probability of a union, and more.
متن کاملBiclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
We study the minimum number of complete bipartite subgraphs needed to cover and partition the edges of a k-regular bigraph on 2n vertices. Bounds are determined on the minima of these numbers for fixed n and k. Exact values of the minima are found for all n and k 6 4. The same results hold for directed graphs. Equivalently, we have determined bounds on the minimum value of the Boolean and nonne...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008